On Almost-Sure Intention Deception Planning that Exploits Imperfect Observers

Almost Sure Productivity

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...

Beyond Almost-Sure Termination

The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...

On the Hardness of Almost-Sure Termination

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...

On almost sure elimination of generalized quantifiers

Almost Sure Classification of Densities

Let a class F of densities be given. We draw an i.i.d. sample from a density f which may or may not be in F . After every n, one must make a guess whether f ∈ F or not. A class is almost surely discernible if there exists such a sequence of classification rules such that for any f , we make finitely many errors almost surely. In this paper several results are given that allow one to decide whet...